Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time
نویسندگان
چکیده
We address the problem of computing the exact characteristics of any subsegment of a digital straight line with known characteristics. We present a new algorithm that solves this problem, whose correctness is proved. Its principle is to climb the SternBrocot tree of fraction in a bottom-up way. Its worst-time complexity is proportionnal to the difference of depth of the slope of the input line and the slope of the output segment. It is thus logarithmic in the coefficients of the input slope. We have tested the effectiveness of this algorithm by computing a multiscale representation of a digital shape, based only on a digital straight segment decomposition of its boundary. Keyword: standard lines, digital straight segment recognition, Stern-Brocot tree.
منابع مشابه
Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity
Given a Digital Straight Line (DSL) of known characteristics (a, b, μ), we address the problem of computing the characteristics of any of its subsegments. We propose two new algorithms that use the fact that a digital straight segment (DSS) can be defined by its set of separating lines. The representation of this set in the Z space leads to a first algorithm of logarithmic time complexity. This...
متن کاملRemainder approach for the computation of digital straight line subsegment characteristics
Given a digital straight line D of known characteristics (a, b, c), and given two arbitrary discrete points A(xa, ya) and B(xb, yb) of it, we are interested in computing the characteristics of the digital straight segment (DSS) of D delimited by the endpoints A and B. Our method is based entirely on the remainder subsequence S = {ax − c mod b; xa ≤ x ≤ xb}. We show that minimum and maximum rema...
متن کاملWalking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment
Given a Digital Straight Line (DSL) of known characteristics (a, b, μ), we address the problem of computing the characteristics of any of its subsegments. We propose a new algorithm as a smart walk in the so called Farey Fan. We take profit of the fact that the Farey Fan of order n represents in a certain way all the digital segments of length n. The computation of the characteristics of a DSL ...
متن کاملAn Arithmetical Characterization of the Convex Hull of Digital Straight Segments
In this paper, we arithmetically describe the convex hull of a digital straight segment by three recurrence relations. This characterization gives new insights into the combinatorial structure of digital straight segments of arbitrary length and intercept. It also leads to two on-line algorithms that computes a part of the convex hull of a given digital straight segment. They both run in consta...
متن کاملComputing of the Burnt Forest Regions Area Using Digital Image Processing
At present, there is no conventional scientific method to evaluate the area of the burnt regions of forests and in this field, the related organizations use different methods and variables. Also, the speed in performing the processes of area computing and damage evaluation, especially in the extensive damaged forest regions is very slow; consequently, the expression of results takes more ti...
متن کامل